Refined restricted involutions

نویسندگان

  • Emeric Deutsch
  • Aaron Robertson
  • Dan Saracino
چکیده

Define I n(α) to be the set of involutions of {1, 2, . . . , n} with exactly k fixed points which avoid the pattern α ∈ Si, for some i ≥ 2, and define I n(∅;α) to be the set of involutions of {1, 2, . . . , n} with exactly k fixed points which contain the pattern α ∈ Si, for some i ≥ 2, exactly once. Let in(α) be the number of elements in I k n(α) and let i k n(∅;α) be the number of elements in I n(∅;α). We investigate I n(α) and I n(∅;α) for all α ∈ S3. In particular, we show that in(132) = i k n(213) = i k n(321), i k n(231) = i k n(312), i k n(∅; 132) = in(∅; 213), and in(∅; 231) = in(∅; 312) for all 0 ≤ k ≤ n.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Models and refined models for involutory reflection groups and classical Weyl groups

A finite subgroup G of GL(n,C) is involutory if the sum of the dimensions of its irreducible complex representations is given by the number of absolute involutions in the group, i.e. elements g ∈ G such that gḡ = 1, where the bar denotes complex conjugation. A uniform combinatorial model is constructed for all non-exceptional irreducible complex reflection groups which are involutory including,...

متن کامل

ul 2 00 3 Restricted 3412 - Avoiding Involutions : Continued Fractions , Chebyshev Polynomials and Enumerations ∗

Several authors have examined connections among restricted permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for involutions which avoid 3412. Our results include a recursive procedure for computing the generating function for involutions which avoid 3412 and any set of additional patterns. We use our results to gi...

متن کامل

Ja n 20 04 Involutions Restricted by 3412 , Continued Fractions , and Chebyshev Polynomials

We study generating functions for the number of involutions, even involutions, and odd involutions in Sn subject to two restrictions. One restriction is that the involution avoid 3412 or contain 3412 exactly once. The other restriction is that the involution avoid another pattern τ or contain τ exactly once. In many cases we express these generating functions in terms of Chebyshev polynomials o...

متن کامل

Restricted 132 - Involutions

We study generating functions for the number of involutions of length n avoiding (or containing exactly once) 132 and avoiding (or containing exactly once) an arbitrary permutation τ of length k. In several interesting cases these generating functions depend only on k and can be expressed via Chebyshev polynomials of the second kind. In particular, we show that involutions of length n avoiding ...

متن کامل

Refined Dual Stable Grothendieck Polynomials and Generalized Bender-Knuth Involutions

The dual stable Grothendieck polynomials are a deformation of the Schur functions, originating in the study of the K-theory of the Grassmannian. We generalize these polynomials by introducing a countable family of additional parameters, and we prove that this generalization still defines symmetric functions. For this fact, we give two self-contained proofs, one of which constructs a family of i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2007